Chapter 14: Optimal Winner Determination Algorithms
نویسنده
چکیده
منابع مشابه
Integer Programming for Combinatorial Auction Winner Determination
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the auction, while keeping risks for bidders low. However, the determination of an optimal winner combination in combinatorial auctions is a complex computational problem. In this paper we (i) compare recent algorithms fo...
متن کاملAlgorithms for Distributed Winner Determination in Combinatorial Auctions
The problem of optimal winner determination in combinatorial auctions consists of finding the set of bids that maximize the revenue for the sellers. Various solutions exist for solving this problem but they are all centralized. That is, they assume that all bids are sent to a centralized auctioneer who then determines the winning set of bids. In this paper we introduce the problem of distribute...
متن کاملInteger Programming for Automated Auctions
Auctions allowing bids for combinations of items are important for (agent mediated) electronic commerce; compared to other auction mechanisms, they often increase the efficiency of the auction, while keeping risks for bidders low. The determination of an optimal winner combination in this type of auctions is a complex computational problem, which has recently attracted some research, and in thi...
متن کاملEffects of Approximation on an Iterative Combinatorial Auction
HARISH G KAMMANAHALLI. Effects of Approximation on an Iterative Combinatorial Auction. (Under the direction of Dr Ṗeter Wurman.) Combinatorial auctions are a promising way of solving the complicated heterogeneous resource allocation problem. However combinatorial auctions present inherently hard computational problems for agents and auctioneers. In particular (1) the auction must solve the winn...
متن کاملSelecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004